Power-Aware Localized Routing in Wireless Networks

We discuss routing algorithms for wireless networks with the goal of increasing the network and node life. Recently, a cost aware metric based on remaining battery power at nodes was proposed and verified for non-localized shortest-cost routing algorithms, assuming constant transmission power. Two metrics where transmission power depends on distance between nodes were also recently proposed. We define a new power-cost metric based on the combination of both node's lifetime and distance based power metrics. We then propose power, cost, and power-cost GPS based fully distributed (i.e. localized) routing algorithms, where nodes make routing decisions solely on the basis of location of their neighbors and destination. Power aware localized routing algorithm attempts to minimize the total power needed to route a message between a source and a destination. Cost-aware localized algorithm is aimed at extending battery’s worst case lifetime. The combined power-cost localized routing algorithm attempts to minimize the total power needed and to avoid nodes with short battery’s remaining lifetime. We prove that the proposed localized power, cost, and power-cost efficient routing algorithms are loop-free, and show their efficiency by experiments.